State Graph Manipulators ( SGM ) A High - Level Speci cation and Veri cation Tool for Real - Time Systems

نویسندگان

  • Pao-Ann Hsiung
  • Farn Wang
چکیده

The current technology of veriication engineering requires personnels to be well-trained in logics and au-tomata theory, such that in order to attack the well-known state-space explosion problem they must carefully tune existing veriication packages. Several researches have resulted in a large number of techniques for reducing the system state-space, such as symmetry-based reductions , partial-order semantics, bisimulation equivalences, and others. To let more people beneet from the technology of computer-aided veriication, even people with little training in the related theories, a new veriication tool called State Graph Manipulators (SGM) has been developed to package various sophisticated veriication techniques as manipulators acting on high-level data-object representations of state-spaces called state-graphs. Experiments conducted using SGM show how the tool can increase veriication eeciency and scalability. This article describes the features of SGM and how can a user may use SGM to experiment with state-space reductions and system veriication.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transformations on Dependency Graphs :

Dependency graphs are used to model data and control ow in hardware and software design. In a transformational design approach, optimization and re nement transformations are used to transform dependency-graph-based speci cations at higher abstraction levels to those at lower abstraction levels. In this dissertation, we investigate the formal speci cation and mechanical veri cation of transform...

متن کامل

The Temporal Specification and . . .

We extend the speci cation language of temporal logic, the corresponding veri cation framework, and the underlying computational model to deal with real-time properties of reactive systems. Semantics We introduce the abstract computational model of timed transition systems as a conservative extension of traditional transition systems: qualitative fairness requirements are superseded by quantita...

متن کامل

Abstraction and Modular Veriication of Innnite-state Reactive Systems ?

ion and Modular Veri cation of In nite-State Reactive Systems ? Zohar Manna, Michael A. Col on, Bernd Finkbeiner, Henny B. Sipma and Tom as E. Uribe Computer Science Department Stanford University Stanford, CA. 94305-9045 [email protected] Abstract. We review a number of temporal veri cation techniques for reactive systems using modularity and abstraction. Their use allows the veri cation o...

متن کامل

Model Checking Timing Requirements

Model checking has been used successfully to analyze concurrent nite state systems The behavioral speci cation of the system is transformed into a nite representation of the speci cation s reachability graph System properties to be veri ed are expressed as temporal logic formulae A model checker accepts a system s reachability graph and a system property and through exhaustive analysis determin...

متن کامل

Formal Requirements Analysis of an Avionics Control System

|We report on a formal requirements analysis experiment involving an avionics control system. We describe a method for specifying and verifying real-time systems with PVS. The experiment involves the formalization of the functional and safety requirements of the avionics system as well as its multilevel veri cation. First level veri cation demonstrates the consistency of the speci cations whils...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999